Finding a minimum medial axis of a discrete shape is NP-hard
نویسندگان
چکیده
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may exist without changing the reversivility of the input shape representation. In this article, we first prove that finding a minimum medial axis is an NP-hard problem for the Euclidean distance. Then, we compare two algorithms which compute an approximation of the minimum medial axis, one of them providing bounded approximation results.
منابع مشابه
The Minimum Guarding Tree Problem
Given a set L of non-parallel lines in the plane and a nonempty subset L′ ⊆ L, a guarding tree for L′ is a tree contained in the union of the lines in L such that if a mobile guard (agent) runs on the edges of the tree, all lines in L′ are visited by the guard. Similarly, given a connected arrangement S of line segments in the plane and a nonempty subset S ′ ⊆ S, we define a guarding tree for S...
متن کاملCycle transversals in bounded degree graphs
In this work we consider the problem of finding a minimum Ck-transversal (a subset of vertices hitting all the induced chordless cycles with k vertices) in a graph with bounded maximum degree. In particular, we seek for dichotomy results as follows: for a fixed value of k, finding a minimum Ck-transversal is polynomial-time solvable if k ≤ p, and NP -hard otherwise.
متن کاملMinimum decomposition of a digital surface into digital plane segments is NP-hard
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a decomposition with less than λ DPS ?) is NP-complete, and thus that the optimisation problem (finding the minimum number of DPS) is NP-hard. The proof is based on a polynomial reduction of any instance of the well-know...
متن کاملAppearance Radii in Medial Axis Test Mask for Small Planar Chamfer Norms
The test mask TM is the minimum neighbourhood sufficient to extract the medial axis of any discrete shape, for a given chamfer distance mask M. We propose an arithmetical framework to study TM in the case of chamfer norms. We characterize TM for 3×3 and 5×5 chamfer norm masks, and we give an algorithm to compute the appearance radius of the vector (2, 1) in TM.
متن کاملFinding a minimal tree in a polygon with its medial axis
In order to solve a problem arising when generalizing topographical maps, we consider the following problem for simple polygons, i.e., coherent polygons without holes. Some edges of the polygon may be marked as hard, and at least two vertices of the polygon are marked as terminals. We show that the problem to nd a tree of minimum total length, spanning the hard edges and terminals, using only e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 406 شماره
صفحات -
تاریخ انتشار 2008